Uniform (Ck, Pk+1)-Factorizations of Kn − I When k Is Even
نویسندگان
چکیده
Let H be a connected subgraph of graph G. An H-factor G is spanning whose components are isomorphic to H. Given set mutually non-isomorphic graphs, uniform H-factorization partition the edges into H-factors for some H∈H. In this article, we give complete solution existence problem (Ck,Pk+1)-factorizations Kn−I in case when k even.
منابع مشابه
The Spanning Laceability of k-ary n-cubes when k is Even
Qn has been shown as an alternative to the hypercube family. For any even integer k ≥ 4 and any integer n ≥ 2, Qn is a bipartite graph. In this paper, we will prove that given any pair of vertices, w and b, from different partite sets of Qn, there exist 2n internally disjoint paths between w and b, denoted by {Pi | 0 ≤ i ≤ 2n− 1}, such that ⋃2n−1 i=0 Pi covers all vertices of Qn. The result is ...
متن کاملThe number of 8-cycles in 2-factorizations of Kn
This paper gives a complete solution (with one possible exception) of the problem of constructing 2-factorizations of Kn containing a specified number of 8-cycles.
متن کاملOn bipartite 2-factorizations of kn - I and the Oberwolfach problem
It is shown that if F1, F2, . . . , Ft are bipartite 2-regular graphs of order n and α1, α2, . . . , αt are non-negative integers such that α1+α2+· · ·+αt = n−2 2 , α1 ≥ 3 is odd, and αi is even for i = 2, 3, . . . , t, then there exists a 2-factorisation of Kn−I in which there are exactly αi 2-factors isomorphic to Fi for i = 1, 2, . . . , t. This result completes the solution of the Oberwolfa...
متن کاملMutually independent Hamiltonian cycles in k-ary n-cubes when k is even
The k-ary n-cubes, Qn, is one of the most well-known interconnection networks in parallel computers. Let n ≥ 1 be an integer and k ≥ 3 be an odd integer. It has been shown that any Qn is a 2n-regular, vertex symmetric and edge symmetric graph with a hamiltonian cycle. In this article, we prove that any k-ary n-cube contains 2n mutually independent hamiltonian cycles. More specifically, let vi ∈...
متن کاملRainbow and Orthogonal Paths in Factorizations of Kn
For n even, a factorization of a complete graph Kn is a partition of the edges into n−1 perfect matchings, called the factors of the factorization. With respect to a factorization, a path is called rainbow if its edges are from distinct factors. A rainbow Hamiltonian path takes exactly one edge from each factor and is called orthogonal to the factorization. It is known that not all factorizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10060936